Approximate subgroups with bounded VC-dimension

نویسندگان

چکیده

We combine the fundamental results of Breuillard, Green, and Tao (Publ Math Inst Hautes Études Sci 116:115–221, 2012) on structure approximate groups, together with “tame” arithmetic regularity methods based work authors Terry (J Eur Soc (JEMS) 24(2):583–621, 2022), to give a theorem for finite subsets A arbitrary groups G where has “small tripling” bounded VC-dimension: Roughly speaking, up small error, will be union number translates coset nilprogression rank step (see Theorem 2.1). also prove stronger result in setting exponent 2.2). Our extend recent Martin-Pizarro, Palacín, Wolf (Selecta (N.S.) 27(4):Paper No. 53, 19,2021) stable sets tripling.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension

The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VCdimension of the set system induced by the neighborhoods of its vertices. We show that every n-vertex graph with bounded VC-dimension contains a clique or an independent set of size at least e(logn) . The dependence on the VC-dimension is hidden in the o(1) term. This improves the general lower bound, e √ ...

متن کامل

Bounded VC-Dimension Implies a Fractional Helly Theorem

We prove that every set system of bounded VC-dimension has a fractional Helly property. More precisely, if the dual shatter function of a set system F is bounded by o(m k), then F has fractional Helly number k. This means that for every > 0 there exists a > 0 such that if F 1 ; F 2 ; : : : ; F n 2 F are sets with T i2I F i 6 = ; for at least ? n k sets I f1; 2; : : :; ng of size k, then there e...

متن کامل

Teaching Dimension versus VC Dimension

In this report, we give a brief survey of various results relating the Teaching Dimension and VC-Dimension. The concept of Teaching Dimension was first introduced by Goldman and Kearns, 1995 and Sinohara and Miyano, 1991. In this model, an algorithm tries to learn the hidden concept c from examples, called the teaching set, which uniquely identifies c from the rest of the concepts in the concep...

متن کامل

VC dimension of ellipsoids

We will establish that the vc dimension of the class of d-dimensional ellipsoids is (d +3d)/2, and that maximum likelihood estimate with N -component d-dimensional Gaussian mixture models induces a geometric class having vc dimension at least N(d + 3d)/2.

متن کامل

Neural Networks with Quadratic VC Dimension

This paper shows that neural networkswhich use continuousactivation functions have VC dimension at least as large as the square of the number of weights w. This results settles a long-standing open question, namely whether the well-known O(w log w) bound, known for hardthreshold nets, also held for more general sigmoidal nets. Implications for the number of samples needed for valid generalizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Annalen

سال: 2022

ISSN: ['1432-1807', '0025-5831']

DOI: https://doi.org/10.1007/s00208-022-02524-3